On the largest prime factor of the Mersenne numbers
نویسندگان
چکیده
Let P (k) be the largest prime factor of the positive integer k. In this paper, we prove that the series ∑ n≥1 (log n)α P (2n − 1) is convergent for each constant α < 1/2, which gives a more precise form of a result of C. L. Stewart of 1977.
منابع مشابه
Mersenne and Fermat Numbers
The first seventeen even perfect numbers are therefore obtained by substituting these values of ra in the expression 2n_1(2n —1). The first twelve of the Mersenne primes have been known since 1914; the twelfth, 2127 —1, was indeed found by Lucas as early as 1876, and for the next seventy-five years was the largest known prime. More details on the history of the Mersenne numbers may be found in ...
متن کاملGeneralization of a Theorem of Drobot
It is well known that the Fibonacci number Fn can be a prime only If n 4 or n p, where p is an odd prime. Throughout this paper, p will denote a prime. In a very interesting paper, Drobot [2] proved that Fp is composite for certain primes p. In particular, he proved that if p > 7, p = 2 or 4 (mod 5), and 2p -1 is also a prime, then 2p -11 Fp and Fp > 2p . For example, 371 Fl9 = 4181-37-113. A s...
متن کاملDivisors of Mersenne Numbers By Samuel
We add to the heuristic and empirical evidence for a conjecture of Gillies about the distribution of the prime divisors of Mersenne numbers. We list some large prime divisors of Mersenne numbers Mp in the range 17000 < p < 105.
متن کاملApplications of Multizeta Values to Mahler Measure
These notes correspond to a mini-course taught by the author during the program “PIMS-SFU undergraduate summer school on multiple zeta values: combinatorics, number theory and quantum field theory”. Please send any comments or corrections to the author at [email protected]. 1. Primes, Mahler Measure, and Lehmer’s question We start our study by discussing prime numbers. First consider the ...
متن کاملRandom Number Generators with Period Divisible by a Mersenne Prime
Pseudo-random numbers with long periods and good statistical properties are often required for applications in computational finance. We consider the requirements for good uniform random number generators, and describe a class of generators whose period is a Mersenne prime or a small multiple of a Mersenne prime. These generators are based on “almost primitive” trinomials, that is trinomials ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007